Extending Parallel Pseudo-Code Language Peril-L
نویسنده
چکیده
In this paper, we propose to extend the Peril-L parallel pseudo-code language. The extensions added to the Peril-L are essential to express non-trivial parallel algorithms. We demonstrate the effectiveness of the extended Peril-L by showing the parallel algorithms for the Jacobi method for solving differential equations and the dynamic programming method for finding the optimal binary search tree.
منابع مشابه
ILIAS, a Sequential Language for Parallel Matrix Computations
The ILIAS system consists of a. sequential language for matrix computations, a compiler translating a. source program into ILIAS pseudo code and a parallel interpreter for this code. The pseudo code is independent of a target architecturej it merely specifies scalar and matrix computations. We present the ILIAS language and discuss its implementation on a square torus network of transputers. Su...
متن کاملGeneric Cluster-Computing Algorithms and Applications
We define several generic cluster-computing algorithms, each of them encapsulating a general purpose control structure. By extending these generic algorithms with sequential code, we derive specific cluster-computing algorithms for diverse problems. We use a specification and prototyping language to test the validity of the derived parallel algorithms before finally converting them into efficie...
متن کاملVisualizable Pseudo Programming Language
Selecting a right programming language for introductory CS courses is not an easy task. The pressure to use a commercially successful language can easily be the most significant factor in choosing the language. However, several studies suggest that it is preferable to use language especially designed for teaching. These languages are usually some kind of pseudo languages, defined by the program...
متن کاملPerformance Evaluation of Parallel Simd
A simulator for SIMD type architectures is presented. Starting from an architecture independent algorithm description based on recurrence equations, transformation steps for automatic parallelization, mapping and code generation are outlined. The nal pseudo code program together with architecture dependent parameters and execution time tables, are fed into the simulator in order to gain perform...
متن کاملReducing the complexity of debugging parallel REPLICA programs with pluggable abstraction patterns
Traditional debuggers focus on a single thread at a time or are better suited for concurrent programming with a low number of interacting threads and/or distributed memory, making it hard to monitor a massively data-parallel program on a shared memory multi-core system. This work considers a globally step-synchronous model of computation. Compared to contemporary multi-core processors with inde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008